Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

4 Publications


2021 | Journal Article | LibreCat-ID: 48854
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179.
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 48847
More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization
J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1277–1285.
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 48851
The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics
J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1286–1294.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 48843
Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring
J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 1443–1451.
LibreCat | DOI
 

Filters and Search Terms

keyword="running time analysis"

Search

Filter Publications

Display / Sort

Export / Embed